cube ferm quotient emerg constrain close datacub cube convex convex hull set point smallest convex set point articl present practic convex hull algorithm combin dimension quickhul algorithm gener dimens beneath algorithm similar random increment algorithm convex hull delaunai triangul provid empir evid algorithm run faster input nonextrem point memori comput geometri algorithm tradition assum input set behav algorithm implement float point arithmet assumpt lead error briefli describ solut problem comput convex hull dimens output set thick facet exact convex hull input variat effect dimens treilli de concept skylin analys multidimensionnel de skylin fond sur le ensembl en accord reduc represent emerg cube olap databas mine lossless reduct datacub partit emerg cube border size estim lossless reduct upper border emerg cube sum du cube emerg convex cube unifi structur multidimension databas emerg cube trend analysi olapdatabas cocktail de cube lossless reduct datacub cube convex convex hull set point smallest convex set point articl present practic convex hull algorithm combin dimension quickhul algorithm gener dimens beneath algorithm similar random increment algorithm convex hull delaunai triangul provid empir evid algorithm run faster input nonextrem point memori comput geometri algorithm tradition assum input set behav algorithm implement float point arithmet assumpt lead error briefli describ solut problem comput convex hull dimens output set thick facet exact convex hull input variat effect dimens duction du cube de donn es essenti pattern perfect cover frequent pattern effici mine associ rule base formal concept analysi abstract associ rule popular knowledg discoveri techniqu warehous basket analysi item warehous frequent bought problem associ rule mine state year research group discov problem strong connect formal concept analysi fca survei introduc basic idea connect specif algorithm titan show fca help reduc number result rule loss inform give gener overview histori state art appli fca associ rule mine couvertur parfait de motif fr quent gener condens represent associ rule associ rule extract oper dataset produc ten thousand million associ rule rule redund useless semant base closur galoi connect defin condens represent associ rule represent character frequent close itemset gener redund associ rule minim anteced maxim consequ call min max associ rule rule relev gener redund associ rule represent basi gener set associ rule support confid retriev needless access data introduc algorithm extract basi reconstruct associ rule result experi carri real dataset show us approach order gener basi algorithm extract frequent itemset apriori instanc present algorithm deriv frequent close itemset gener frequent itemset dataset motif essentiel inf renc de fr quenc extract de mantiqu dan le base de donn es multidimensionnel extract espac de version mergent un relat attribut cat gori extract semant data cube cube transvers closur treilli cube contraint pour la fouill de base de donn es multidimensionnel cube lattic framework multidimension data mine constrain multidimension pattern differ frequent pattern conceptu logic point view provid common structur support type constraint classic data mine techniqu base power set lattic binari attribut extend suitabl address discoveri constrain multidimension pattern paper propos foundat multidimension data mine problem introduc algebra structur call cube lattic character search space explor consider monoton antimonoton constraint enforc mine multidimension pattern addit propos condens represent constrain cube lattic convex space final place emphasi advantag cube lattic compar power set lattic binari attribut multidimension data mine treilli cube contraint pour la fouill de base de donn es multidimensionnel treilli relationnel un structur alg briqu pour le data mine multi ddimensionnel comput full iceberg datacub partit comput iceberg concept lattic function approxim depend mine databas fca point view framework understand exist databas papec propos framework broad class data mine algorithm understand exist databas function approxim depend infer enc minim kei infer relat gener normal form test point common data centric step algorithm discoveri agre set set orient approach discov agre set databas relat base sql queri propos periment perform order compar pro pose approach data mine approach present extract approxim finction depen denci minim error agre set intellig structur reduc associ rule formal concept analysi associ rule investig larg databas analyst confront larg list rule find relev purpos base result knowledg represent theoret framework formal concept analysi present small base associ rule rule deduc provid algorithm calcul discov agre set databas relat analysi levelwis search frequent pattern count infer paper propos algorithm pascal introduc optim algorithm apriori provid minsup threshold pascal discov frequent pattern perform count order deriv support larger pattern access databas knowledg support pattern call kei pattern experi compar pascal algorithm apriori close max miner repres frequent pattern discoveri strategi show pascal effici algorithm extract pattern strongli correl data execut time equival apriori max miner data weakli correl knowledg discoveri larg databas frequent concept lattic mine minim dredund associ rule frequent close itemset problem relev us extract associ rule primari import major case real life databas lead thousand associ rule high condenc redund closur galoi connect dene base associ rule union gener set valid associ rule support condenc base character frequent close itemset gener consist redund exact approxim associ rule minim anteced maxim consequ relev associ rule algorithm extract base present result experi carri real life databas show propos base gener time consum knowledg discoveri larg databas frequent concept lattic effici discoveri function depend armstrong relat mine base associ rule close set mine frequent pattern count infer acb amp lt amp gt ci fca hkmlonqpr nqsedt ga amp xhyhu lt gt fc gt amp vf amp ab fdc gt amp amp amp amp gfih lt gt amp lt gt lt xf gt dk lt ga gt amp lu gt mhn opqrk amp rhogv wxv rcypqpr sp gt ta lt amp uf hu mhn opqrh lt fd amp gt amp lt gy fca amp xfc hwa gt amp lt gt aga amp af km amp byh gt amp amp lt dt amp gt uu lt lt amp zx gt gt cj gt lt amp amp ke amp lt uf ke gt ca amp jlnp ns amp amp amp gt amp amp hk lt amp amp gb lt amp gt xzz gt cbwgz ab lt fd amp gt xlnqpr ns lt gt kef hj amp zkef lt eu gt ci amp amp hk lt fca ke gt amp lt fast comput concept lattic data mine techniqu present algorithm call titan comput concept lattic base data mine techniqu comput frequent itemset algorithm experiment evalu compar ganter closur algorithm mine frequent pattern count infer acb amp lt amp gt ci fca hkmlonqpr nqsedt ga amp xhyhu lt gt fc gt amp vf amp ab fdc gt amp amp amp amp gfih lt gt amp lt gt lt xf gt dk lt ga gt amp lu gt mhn opqrk amp rhogv wxv rcypqpr sp gt ta lt amp uf hu mhn opqrh lt fd amp gt amp lt gy fca amp xfc hwa gt amp lt gt aga amp af km amp byh gt amp amp lt dt amp gt uu lt lt amp zx gt gt cj gt lt amp amp ke amp lt uf ke gt ca amp jlnp ns amp amp amp gt amp amp hk lt amp amp gb lt amp gt xzz gt cbwgz ab lt fd amp gt xlnqpr ns lt gt kef hj amp zkef lt eu gt ci amp amp hk lt fca ke gt amp lt discov frequent close itemset associ rule paper address problem find frequent itemset databas close itemset lattic framework show problem reduc problem find frequent close itemset base statement construct effici data mine algorithm limit search space close itemset lattic subset lattic show set frequent close itemset suffic determin reduc set associ rule address import data mine problem limit number rule produc inform loss propos algorithm call close closur mechan find frequent close itemset realiz experi compar approach commonli frequent itemset search approach experi show approach valuabl dens correl data repres import part exist databas close set base discoveri small cover associ rule paper address problem us set discov associ rule problem import real life databas yield time thousand rule high confid propos algorithm base galoi close set reduc extract small cover base exact approxim rule frequent close itemset constitut gener set frequent itemset associ rule discov addit databas pass need deriv base experi conduct real life databas show algorithm effici valuabl practic effici mine associ rule close itemset lattic discov associ rule import task data mine effici algorithm propos literatur notic apriori mannila algorithm partit sampl dic base apriori mine method prune subset lattic itemset lattic paper propos effici algorithm call close base mine method prune close set lattic close itemset lattic lattic order subset lattic close relat will concept lattic formal concept analysi experi compar close optim version apriori show close effici mine dens correl data censu style data perform market basket style data queri concept lattic object databas concept lattic conceptu model firstli introduc will formal concept analysi theori concept format deriv lattic order theori concept lattic base applic report domain conceptu cluster conceptu knowledg represent acquisit inform retriev paper propos object databas approach manag concept lattic applic goal work fold extend concept lattic model basic oper support concept analysi oper search discov data directli concept lattic present approach model queri concept lattic object databas framework prune close itemset lattic associ rule discov associ rule import task data mine effici algorithm propos literatur notic apriori mannila algorithm partit sampl dic base apriori mine method prune subset lattic itemset lattic paper propos effici algorithm call close base mine method prune close set lattic close itemset lattic lattic order subset lattic close relat will concept lattic formal concept analysi experi compar close optim version apriori show close effici mine dens correl data censu data perform market basket style data queri concept lattic object databas concept lattic conceptu model firstli introduc will formal concept analysi theori concept format deriv lattic order theori concept lattic base applic report domain conceptu cluster conceptu knowledg represent acquisit inform retriev paper propos object databas approach manag concept lattic applic goal work fold extend concept lattic model basic oper support concept analysi oper search discov data directli concept lattic present approach model queri concept lattic object databas framework design class hierarchi object databas schema object databas approach manag concept lattic concept lattic conceptu model firstli introduc will formal concept analysi theori concept format deriv lattic order theori concept lattic base applic report domain conceptu cluster conceptu knowledg represent acquisit inform retriev paper propos object databas approach manag concept lattic applic goal work fold extend concept lattic model basic oper support concept analysi oper search discov data directli concept lattic present approach model queri concept lattic object databas framework build inherit graph object databas design io algorithm method build inherit graph object databas design matrix drelat statist databas manag consist structur updat object databas design formal approach object databas design paper focus formal approach advanc databas model design base model extens semant model defin abiteboul hull preserv acquir ifo step develop heterogen feder databas consist translat local schema canon data model paper offer method transform relat schema equival object orient studi translat nari relationship tabl gt canon data model ifo data model translat relat schema combin data schema data instanc analysi stage deduct ifo basic type deduct ifo edg function deduct ifo fragment introduct level schema architectur preexist databas interoper canon data model common feder adopt schema local databas transform nativ model canon model give compon schema compon schema filter export schema logic summari ddata model macro statist databas complex dstatist dtabl structur oper macro statist databas rtl relat tabl languag statist databas sql du casual duser orient interfac relat dbm micro dcomput 